Fast equivalence-checking for normed context-free processes
نویسندگان
چکیده
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously known complexity O(n8polylog(n)). It also improves the previously known complexity O(n6polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1
منابع مشابه
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n) time. We give an alternative algorithm working in O(npolylog n) time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from O(npolylog n) to O(npolylog n).
متن کاملA Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.
متن کاملDecidability of Bisimulation Equivalence of Context-free Processes Extends to Processes Deened over Bpa
In CHS92] was proved that (strong) bisimulation equivalence is de-cidable for all context-free processes. We reduce eeectively the question of bisimulation equivalence of processes in BPA to that of context-free processes, by interpreting the deadlocking process as a process which iterates a fresh action forever. This shows that bisimulation is also decidable for BPA. 1 Introduction In BBK87, B...
متن کاملA Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in Z; = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-tim...
متن کاملTowards characterizing bisimilarity of value-passing processes with context-free control
A value-passing version of normed context-free processes is considered, where process behaviours depend on a global state of data variables. The problem of characterizing bisimilarity of such processes is posed. A solution of the formulated problem is presented for a restricted class of processes and possibilities of extending the result are discussed. The presented solution exploits a tableau ...
متن کامل